Proving performance propterties (even probabilistic ones)
نویسنده
چکیده
This paper surveys some new tools and methods for formally verifying time performance properties of systems that satisfy timing assumptions. The techniques are potentially of practical beneet in the validation of real-time process control and communication systems. The tools and methods include nondeterministic timed automaton models, invariant assertion and simulation techniques for proving worst-case time bounds, probabilistic timed automaton models, and Markov-style techniques for proving probabilistic time bounds. All of these techniques are well suited for (partial) mechanization.
منابع مشابه
Probabilistic Evaluation of Seismic Performance of RC Bridges in Iran
Many existing bridges were designed without adequate consideration of seismic risk. The full or partial collapse of even one major bridge in a city or community would have destroying results. There has been focuses on developing fragility-based seismic vulnerability of existing usual bridges in Iran or support decision making on seismic upgrade. This article focuses on developing performance b...
متن کاملComputability, inference and modeling in probabilistic programming
We investigate the class of computable probability distributions and explore the fundamental limitations of using this class to describe and compute conditional distributions. In addition to proving the existence of noncomputable conditional distributions, and thus ruling out the possibility of generic probabilistic inference algorithms (even inefficient ones), we highlight some positive result...
متن کاملProving Lower Bounds and Formalizing Knowledge in Randomized Computing: a General Randomized Model
We present here a general model for randomized distributed computing. This model improves on the previous ones in two important domains. It allows to model precisely the notion of knowledge. It also allows to support formal proofs of probabilistic impossibility.
متن کاملAnalysis and Comparison of PAPR Reduction Techniques in OFDM Systems
The destructive impact of fading environments and also bandwidth limitations are two main challenges which communication is dealing with them. These challenges can affect on the growth of wireless communication and even cause reliable communications and high data rate to be prevented. Thus, OFDM (Orthogonal Frequency Division Multiplexing) modulation by using of fast calculation hardwares such ...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کامل